Searching for Frequent Colors in Rectangles
نویسندگان
چکیده
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction τ of all points in Q are of color c, must be reported. We describe several data structures for that problem that use pseudo-linear space and answer queries in poly-logarithmic time.
منابع مشابه
Significant-Presence Range Queries in Categorical Data
In traditional colored range-searching problems, one wants to store a set of n objects with m distinct colors for the following queries: report all colors such that there is at least one object of that color intersecting the query range. Such an object, however, could be an ‘outlier’ in its color class. Therefore we consider a variant of this problem where one has to report only those colors su...
متن کاملOn coloring points with respect to rectangles
In a coloring of a set of points P with respect to a family of geometric regions one requires that in every region containing at least two points from P , not all the points are of the same color. Perhaps the most notorious open case is coloring of n points in the plane with respect to axis-parallel rectangles, for which it is known that O(n) colors always suffice, and Ω(log n/ log log n) color...
متن کاملOn coloring points with respected to rectangles
In a coloring of a set of points P with respect to a family of regions one requires that in every region containing at least two points from P , not all the points are of the same color. Perhaps the most notorious open case is coloring of n points in the plane with respect to axis-parallel rectangles, for which it is known that O(n) colors always suffice, and Ω(log n/ log log n) colors are some...
متن کاملColoring and Maximum Independent Set of Rectangles
In this paper, we consider two geometric optimization problems: Rectangle Coloring problem (RCOL) and Maximum Independent Set of Rectangles (MISR). In RCOL, we are given a collection of n rectangles in the plane where overlapping rectangles need to be colored differently, and the goal is to find a coloring that minimizes the number of colors. Let q be the maximum clique size of the instance, i....
متن کاملColoring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors
Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n). Essentially the same construction produces Θ(log log n)-chromatic triangle-free intersection graphs of a variety of other geometric shapes—th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0805.1348 شماره
صفحات -
تاریخ انتشار 2008